Quantum computing, postselection, and probabilistic polynomial-time
نویسندگان
چکیده
منابع مشابه
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to ‘postselect’ on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or probabilistic polynomial-time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. T...
متن کاملProbabilistic and quantum finite automata with postselection
We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L¯ ace et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the ...
متن کاملPostselection Finite Quantum Automata
Postselection for quantum computing devices was introduced by S.Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson’s type postselection in quantum finite automata. There are several nonequivalent definitions of qua...
متن کاملTopological Quantum Computing and the Jones Polynomial
In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and Landau for approximating the values of the Jones polynomial at roots of unity of the form e. This description is given with two objectives in mind. The first is to describe the algorithm in such a way as to make explicit the underlying and inherent control structure. The second is to make this alg...
متن کاملQuantum Computing and the Jones Polynomial
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the eva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2005
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.2005.1546